Nordhaus-Gaddum Problems for Colin de Verdière Type Parameters, Variants of Tree-width, and Related Parameters
نویسنده
چکیده
A Nordhaus-Gaddum problem for a graph parameter is to determine a tight lower or upper bound for the sum or product of the parameter evaluated on a graph and on its complement. This article surveys Nordhaus-Gaddum results for the Colin de Verdière type parameters μ,ν , and ξ ; tree-width and its variants largeur d’arborescence, path-width, and proper path-width; and minor monotone ceilings of vertex connectivity and minimum degree.
منابع مشابه
Multi-part Nordhaus-Gaddum type problems for tree-width, Colin de Verdière type parameters, and Hadwiger number
A traditional Nordhaus-Gaddum problem for a graph parameter β is to find a (tight) upper or lower bound on the sum or product of β(G) and β(G) (where G denotes the complement of G). An r-decomposition G1, . . . , Gr of the complete graph Kn is a partition of the edges of Kn among r spanning subgraphs G1, . . . , Gr. A traditional Nordhaus-Gaddum problem can be viewed as the special case for r =...
متن کاملNote on Nordhaus-Gaddum Problems for Colin de Verdière type Parameters
We establish the bounds 43 6 bν 6 bξ 6 √ 2, where bν and bξ are the NordhausGaddum sum upper bound multipliers, i.e., ν(G)+ν(G) 6 bν |G| and ξ(G)+ξ(G) 6 bξ|G| for all graphs G, and ν and ξ are Colin de Verdière type graph parameters. The Nordhaus-Gaddum sum lower bound for ν and ξ is conjectured to be |G| − 2, and if these parameters are replaced by the maximum nullity M(G), this bound is calle...
متن کاملNordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
For a graph G on n vertices with chromatic number χ(G), the Nordhaus–Gaddum inequalities state that d2 √ ne ≤ χ(G) + χ(G) ≤ n + 1, and n ≤ χ(G) · χ(G) ≤ ⌊( n+1 2 )2⌋ . Much analysis has been done to derive similar inequalities for other graph parameters, all of which are integer-valued. We determine here the optimal Nordhaus–Gaddum inequalities for the circular chromatic number and the fraction...
متن کاملParameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a Graph
Tree-width, and variants that restrict the allowable tree decompositions, play an important role in the study of graph algorithms and have application to computer science. The zero forcing number is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by a graph. We establish relationships between these parameters, including several Colin de Verdière type...
متن کاملNordhaus-Gaddum type results for the Harary index of graphs
The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015